Complexity of XOR/XNOR Boolean Functions: A Model using Binary Decision Diagrams and Back Propagation Neural Networks

This paper proposes a model that predicts the complexity of Boolean functions with only XOR/XNOR min-terms using back propagation neural networks (BPNNs) applied to Binary Decision Diagrams (BDDs). The BPNN model (BPNNM) is developed through the training process of experimental data already obtained for XOR/XNOR-based Boolean functions. The outcome of this model is a unique matrix for the complexity estimation over a set of BDDs derived from Boolean expressions with a given number of variables and XOR/XNOR min-terms. The comparison results of the experimental and BPNNM underline the efficiency of this approach, which is capable of providing some useful clues about the complexity of the circuit to be implemented. It also proves the computational capabilities of NNs in providing reliable classification of the complexity of Boolean functions.